MIMOA: A membrane-inspired multi-objective algorithm for green vehicle routing problem with stochastic demands
نویسندگان
چکیده
منابع مشابه
Competitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملAn algorithm for the vehicle routing problem with stochastic demands
Motivated by the fixed routes problem, where the objective is to design a set of routes to be operated unchanged over a period of time, we study the vehicle routing problem with stochastic demands. An algorithm is developed based on a stochastic programming model with recourse. Computational experiments show that the algorithm compares favorably to existing algorithms. This research was support...
متن کاملA genetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
Classical Vehicle Routing Problems (VRPs) normally assume perfect knowledge of the problem parameters such as clients’ demands, and traveling and service times. However, in real world scenarios, very often this is a strong assumption, and the stochastic nature of such parameters should be addressed by specially targeted algorithms [2]. To tackle this aspect, a great research effort has been dev...
متن کاملA memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because of incompatibility constraints must be loaded on independent vehicle compartments. Despite its wide practical applicability the MC-VRP has not received much attention in the literature, and the few existing methods assu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Swarm and Evolutionary Computation
سال: 2021
ISSN: 2210-6502
DOI: 10.1016/j.swevo.2020.100767